home *** CD-ROM | disk | FTP | other *** search
- Path: inforamp.net!usenet
- From: pcurran@inforamp.net (Peter Curran)
- Newsgroups: comp.std.c
- Subject: Re: Restrictions on qsort compare function?
- Date: Wed, 10 Apr 1996 01:54:25 GMT
- Organization: PSC Enterprises
- Message-ID: <4kf4as$b8n@sam.inforamp.net>
- References: <828644274snz@genesis.demon.co.uk> <4k28t4$2g0@sam.inforamp.net> <828726582snz@genesis.demon.co.uk> <DpKFxB.BGG@thinkage.on.ca>
- Reply-To: pcurran@inforamp.net
- NNTP-Posting-Host: ts47-13.tor.istar.ca
- X-Newsreader: Forte Free Agent 1.0.82
-
- On Mon, 8 Apr 1996 23:00:47 GMT in article <DpKFxB.BGG@thinkage.on.ca>
- dat@thinkage.on.ca (David Adrien Tanguay) (David Adrien Tanguay) wrote:
-
- >For Peter Curran: What if a particular comparison function causes some qsort
- >to go into an infinite loop? Is that a non-conforming qsort or a n-c
- >comparison function?
-
- Assuming a comparison function such as I have hypothesized, based on the text of
- the current standard, I would have to say it is a non-conforming qsort. This is
- a ridiculous result, of course, but I think it is a reasonable interpretation of
- the current text.
-
- --
- Peter Curran pcurran@inforamp.net
-
-